- infinite recursive loop
- вчт. бесконечный рекурсивный цикл
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
infinite recursive loop
Смотреть что такое "infinite recursive loop" в других словарях:
Loop variant — In computer science, a loop variant is a mathematical function defined on the state space of a computer program having the property that each iteration of a loop (given its invariant) strictly decreases its value with respect to a well founded… … Wikipedia
Infinite loop — This article is about the programming term. For the street on which Apple Inc. s campus is located, see Infinite Loop (street). An infinite loop (also known as an endless loop) is a sequence of instructions in a computer program which loops… … Wikipedia
Recursive type — In computer programming languages, a recursive type is a data type for values that may contain other values of the same type.An example is the list type, in Haskell: data List a = Nil | Cons a (List a) This indicates that a list of a s is either… … Wikipedia
Strange loop — A strange loop arises when, by moving up or down through a hierarchical system, one finds oneself back where one started. Strange loops may involve self reference and paradox. The concept of a strange loop was proposed and extensively discussed… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
Problems in loop theory and quasigroup theory — In mathematics, especially abstract algebra, loop theory and quasigroup theory are active research areas with many open problems. As in other areas of mathematics, such problems are often made public at professional conferences and meetings. Many … Wikipedia
Tail recursive parser — Tail recursive parsers are derived from the more common Recursive descent parsers. Tail recursive parsers are commonly used to parse left recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers. They… … Wikipedia
Read-eval-print loop — A read eval print loop (REPL), also known as an interactive toplevel, is a simple, interactive computer programming environment. The term is most usually used to refer to a Lisp interactive environment, but can be applied to command line shells… … Wikipedia
Self-organization — is a process of attraction and repulsion in which the internal organization of a system, normally an open system, increases in complexity without being guided or managed by an outside source. Self organizing systems typically (though not always)… … Wikipedia
TARDIS — The TARDIS used from 2005 to 2010 on display at BBC Television Centre … Wikipedia
MUMPS — This article is about the programming language. For other uses, see Mumps (disambiguation). MUMPS Paradigm(s) Procedural Appeared in 1966 Designed by Neil Pappalardo Stable release ANSI X11.1 1995 (December 8, 1995; 15 years ago … Wikipedia
